More planar two-center algorithms
نویسندگان
چکیده
منابع مشابه
More planar two-center algorithms
This paper considers the planar Euclidean two-center problem: given a planar n-point set S, nd two congruent circular disks of the smallest radius covering S. The main result is a deter-ministic algorithm with running time O(n log 2 n log 2 log n), improving the previous O(n log 9 n) bound of Sharir and almost matching the randomized O(n log 2 n) bound of Eppstein. If a point in the intersectio...
متن کاملPLASTIC ANALYSIS OF PLANAR FRAMES USING CBO AND ECBO ALGORITHMS
In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple fra...
متن کاملEnhanced ACS algorithms for plastic analysis of planar frames
In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...
متن کاملTwo Algorithms for Finding Rectangular Duals of Planar Graphs
1 I n t r o d u c t i o n The problem of drawing a graph on the plane has received increasing attention due to a large number of applications [3]. Examples include VLSI layout, algorithm animation, visual languages and CASE tools. Vertices are usually represented by points and edges by curves. In the design of floor planning of electronic chips and in architectural design, it is also common to ...
متن کاملTwo randomized incramental algorithms for planar arrangements, with a twist
We present two results related to randomized incremental construction of planar arrangements: • An algorithm for computing the union of triangles in the plane in a quasi outputsensitive time. • A more efficient alternative to vertical decomposition of arrangements of lines in the plane, called polygonal decomposition. An efficient randomized incremental algorithm for its construction is present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1999
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00019-x